Pseudo-uniform reducibility

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reducibility or Non-uniform Hyperbolicity for Quasiperiodic Schrödinger Cocycles

We show that for almost every frequency α ∈ R\Q, for every Cω potential v : R/Z→ R, and for almost every energy E the corresponding quasiperiodic Schrödinger cocycle is either reducible or non-uniformly hyperbolic. This result gives a very good control on the absolutely continuous part of the spectrum of the corresponding quasiperiodic Schrödinger operator, and allows us to complete the proof o...

متن کامل

Pseudo - Random Numbers : Out of Uniform

Pseudo-random numbers – both uniform and non-uniform – are used in random sampling, simulation, and Monte-Carlo estimation. Base SAS software contains numerous random number, quantile, and probability functions allowing the user to generate a selection of nominal, discrete, and continuous random variates. Other variates may be generated with a data step, often making use of SAS functions. We wi...

متن کامل

Higher-Dimensional Properties of Non-Uniform Pseudo-Random Variates

In this paper we present the results of a rst empirical investigation on how the quality of non-uniform variates is innuenced by the underlying uniform RNG and the transformation method used. We use well known standard RNGs and transformation methods to the normal distribution as examples. We nd that except for transformed density rejection methods, which do not seem to introduce any additional...

متن کامل

Approximating Pseudo-Boolean Functions on Non-Uniform Domains

In Machine Learning (ML) and Evolutionary Computation (EC), it is often beneficial to approximate a complicated function by a simpler one, such as a linear or quadratic function, for computational efficiency or feasibility reasons (cf. [Jin, 2005]). A complicated function (the target function in ML or the fitness function in EC) may require an exponential amount of computation to learn/evaluate...

متن کامل

On ~-reducibility versus Polynomial Time Many-one Reducibility*

We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Mathematical Society of Japan

سال: 1963

ISSN: 0025-5645

DOI: 10.2969/jmsj/01520129